Selective Preemption Strategies for Parallel Job Scheduling
نویسندگان
چکیده
Although theoretical results have been established regarding the utility of preemptive scheduling in reducing average job turnaround time, job suspension/restart is not much used in practice at supercomputer centres for parallel job scheduling. A number of questions remain unanswered regarding the practical utility of preemptive scheduling. We explore this issue through a simulation based study, using real job logs from supercomputer centres. We develop a tuneable selective suspension strategy and demonstrate its effectiveness. We also present new insights into the effect of preemptive scheduling on different job classes and deal with the impact of suspensions on worst case response time. Further, we analyse the performance of the proposed schemes under different load conditions.
منابع مشابه
Makespan Minimization for a Parallel Machine Scheduling Problem with Preemption and Job Incompatibility
متن کامل
Critical Path Method for Flexible Job Shop Scheduling Problem with Preemption
This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound alg...
متن کاملParallel and Sequential Job Scheduling in Heterogeneous Clusters: A Simulation Study Using Software in the Loop
The task of designing and optimizing job scheduling algorithms for heterogeneous computing environments requires the ability to predict scheduling performance. The complexity of heterogeneous scheduling issues requires that the experiments devised to test a scheduling paradigm be both flexible and extensive. Experimentally determined models for the prediction of job execution times on both sequ...
متن کاملAn Optimal Parallel Algorithm for Preemptive Job Scheduling that Minimizes Maximum Lateness
In this paper we present the Preemptive Minimize Maximum Lateness algorithm, an optimal parallel algorithm that schedules jobs for execution on a single processor machine with preemption. Each job is described by a release time, a deadline and a processing time. A job is considered late if it does not complete by its deadline and its lateness is defined as the difference between its completion ...
متن کاملLECTURE #1 Roles of LPT List Scheduling on Parallel Machines
List Scheduling is an approach to finding an approximate non-preemptive schedule on parallel machines, initially due to Graham [4]. We present and analyze the approach for identical machines and an arbitrary jobs list. Then an algorithm based on the LPT (Longest Processing Time) list with an improved performance is discussed, based on [2, 5]. We stress the role of LPT schedules for determining ...
متن کامل